Fast parallel recognition of LR language suffixes
نویسندگان
چکیده
It is shown that suffix recognition for deterministic context-free languages can be done on a PRAM multi-processor within the upper complexity bounds of the graph reachability problem.
منابع مشابه
Improved language recognition using better phonetic decoders and fusion with MFCC and SDC features
One of the most popular and better performing approaches to language recognition (LR) is Parallel Phonetic Recognition followed by Language Modeling (PPRLM). In this paper we report several improvements in our PPRLM system that allowed us to move from an Equal Error Rate (EER) of over 15% to less than 8% on NIST LR Evaluation 2005 data still using a standard PPRLM system. The most successful im...
متن کاملIncorporating Lr Parsing into Sphinx
This paper describes the integration of an LR natural language parser with the SPHINX speech recognition system. SPHINX is one of the most successful speech recognition systems in use today. Although it attains high word accuracy, SPHINX often outputs ungrammatical recognition results because the baseline SPHINX system uses very simple word-pair or bigram language models. For applications of sp...
متن کاملThe LF Language Recognition System for NIST LRE 2011
This document presents a description of INESC-ID’s Spoken Language Systems Laboratory (LF) Language Recognition systems submitted to the 2011 NIST Language Recognition evaluation. The LF primary system consists of the fusion of six individual sub-systems: four phonotactic sub-systems and two acoustic based sub-systems. The major differences of the submitted LR system with respect to previous LF...
متن کاملCompositional Neural Network Language Models for Agglutinative Languages
Continuous space language models (CSLMs) have been proven to be successful in speech recognition. With proper training of the word embeddings, words that are semantically or syntactically related are expected to be mapped to nearby locations in the continuous space. In agglutinative languages, words are made up of concatenation of stems and suffixes and, as a result, compositional modeling is i...
متن کاملMulti-View Learning of Word Embeddings via CCA
NeurRecently, there has been substantial interest in using large amounts of unlabeled data to learn word representations which can then be used as features in supervised classifiers for NLP tasks. However, most current approaches are slow to train, do not model the context of the word, and lack theoretical grounding. In this paper, we present a new learning method, Low Rank Multi-View Learning ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 92 شماره
صفحات -
تاریخ انتشار 2004